Ranking Committees, Words or Multisets

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A bijection between words and multisets of necklaces

In [4] has been proved the bijectivity of a natural mapping Φ from words on a totally ordered alphabet onto multisets of primitive necklaces (circular words) on this alphabet. This mapping has many enumerative applications; among them, the fact that the number of permutations in a given conjugation class and with a given descent set is equal to the scalar product of two representations naturall...

متن کامل

Forcing Monotonicity in Parameterized Verification: From Multisets to Words

We present a tutorial on verification of safety properties for parameterized systems. Such a system consists of an arbitrary number of processes; the aim is to prove correctness of the system regardless of the number of processes inside the system. First, we consider a class of parameterized systems whose behaviours can be captured exactly as Petri nets using counter abstraction. This allows an...

متن کامل

Statistics for Ranking Program Committees and Editorial Boards

Ranking groups of researchers is important in several contexts and can serve many purposes such as the fair distribution of grants based on the scientist’s publication output, concession of research projects, classification of journal editorial boards and many other applications in a social context. In this paper, we propose a method for measuring the performance of groups of researchers. The p...

متن کامل

Generating and ranking of Dyck words

A new algorithms to generate all Dyck words is presented, which is used in ranking and unranking Dyck words. We emphasize the importance of using Dyck words in encoding objects related to Catalan numbers. As a consequence of formulas used in the ranking algorithm we can obtain a recursive formula for the nth Catalan number.

متن کامل

Nested Multisets, Hereditary Multisets, and Syntactic Ordinals in Isabelle/HOL

We present a collection of formalized results about finite nested multisets, developed using the Isabelle/HOL proof assistant. The nested multiset order is a generalization of the multiset order that can be used to prove termination of processes. Hereditary multisets, a variant of nested multisets, offer a convenient representation of ordinals below 0. In Isabelle/HOL, both nested and hereditar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2002

ISSN: 1556-5068

DOI: 10.2139/ssrn.317963